-
1 max flow min cut theorem
теорема о максимальном потоке и минимальном разрезе
—
[Л.Г.Суменко. Англо-русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.]Тематики
EN
Англо-русский словарь нормативно-технической терминологии > max flow min cut theorem
-
2 max-flow min-cut theorem
Универсальный англо-русский словарь > max-flow min-cut theorem
-
3 max-flow min-cut theorem
Англо-русский словарь по экономике и финансам > max-flow min-cut theorem
-
4 max-flow min-cut theorem
English-Russian scientific dictionary > max-flow min-cut theorem
-
5 theorem
- analytical hierarchy theorem - arithmetical hierarchy theorem - closed range theorem - formally provable theorem - implicit function theorem - initial value theorem - integral representation theorem - local limit theorem - maximal ergodic theorem - mean value theorem - normal form theorem - ratio limit theorem - rational root theorem - second mean value theorem - theorem of consistency proofs - theorem of corresponding states - three line theorem - three series theorem - uniform convergence theorem - uniform ergodic theorem - uniform mean value theoremtheorem implies — из теоремы следует, что…
-
6 theorem
См. также в других словарях:
Max-flow min-cut theorem — In optimization theory, the max flow min cut theorem states that in a flow network, the maximum amount of flow passing from the source to the sink is equal to the minimum capacity which when removed in a specific way from the network causes the… … Wikipedia
Max-Flow-Min-Cut-Theorem — Das Max Flow Min Cut Theorem ist ein Satz der Graphentheorie über den maximalen Fluss in Flussnetzwerken. Er leitet sich aus Mengers Theorem ab. Er besagt: Der maximale Fluss im Netzwerk hat genau den Wert dessen minimalen Schnitts. Anders gesagt … Deutsch Wikipedia
Cut (graph theory) — In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets. The cut set of the cut is the set of edges whose end points are in different subsets of the partition. Edges are said to be crossing the cut if they are… … Wikipedia
Flow network — In graph theory, a flow network is a directed graph where each edge has a capacity and each edge receives a flow. The amount of flow on an edge cannot exceed the capacity of the edge. Often in Operations Research, a directed graph is called a… … Wikipedia
Menger's theorem — In the mathematical discipline of graph theory and related areas, Menger s theorem is a basic result about connectivity in finite undirected graphs. It was proved for edge connectivity and vertex connectivity by Karl Menger in 1927. The edge… … Wikipedia
Maximum flow problem — An example of a flow network with a maximum flow. The source is s, and the sink t. The numbers denote flow and capacity. In optimization theory, the maximum flow problem is to find a feasible flow through a single source, single sink flow network … Wikipedia
König's theorem (graph theory) — In the mathematical area of graph theory, König s theorem describes an equivalence between the maximum matching problem and the minimum vertex cover problem in bipartite graphs. Setting A graph is bipartite if its vertices can be partitioned into … Wikipedia
Marriage theorem — In mathematics, the marriage theorem (1935), usually credited to mathematician Philip Hall, is a combinatorial result that gives the condition allowing the selection of a distinct element from each of a collection of subsets.Formally, let S = { S … Wikipedia
Minimum cut — In graph theory, a minimum cut of a graph is a cut whose cutset has the smallest number of elements (unweighted case) or smallest sum of weights possible. Several algorithms exist to find minimum cuts. For a graph G = (V, E), the problem can be… … Wikipedia
Hall's marriage theorem — In mathematics, Hall s marriage theorem is a combinatorial result that gives the condition allowing the selection of a distinct element from each of a collection of finite sets. It was proved by Philip Hall (1935). Contents 1 Definitions and … Wikipedia
List of mathematics articles (M) — NOTOC M M estimator M group M matrix M separation M set M. C. Escher s legacy M. Riesz extension theorem M/M/1 model Maass wave form Mac Lane s planarity criterion Macaulay brackets Macbeath surface MacCormack method Macdonald polynomial Machin… … Wikipedia